An Lp (0 ≤ p ≤ 1)-norm regularized image reconstruction scheme for breast DOT with non-negative-constraint
نویسندگان
چکیده
BACKGROUND In diffuse optical tomography (DOT), the image reconstruction is often an ill-posed inverse problem, which is even more severe for breast DOT since there are considerably increasing unknowns to reconstruct with regard to the achievable number of measurements. One common way to address this ill-posedness is to introduce various regularization methods. There has been extensive research regarding constructing and optimizing objective functions. However, although these algorithms dramatically improved reconstruction images, few of them have designed an essentially differentiable objective function whose full gradient is easy to obtain to accelerate the optimization process. METHODS This paper introduces a new kind of non-negative prior information, designing differentiable objective functions for cases of L1-norm, Lp (0 < p < 1)-norm and L0-norm. Incorporating this non-negative prior information, it is easy to obtain the gradient of these differentiable objective functions, which is useful to guide the optimization process. RESULTS Performance analyses are conducted using both numerical and phantom experiments. In terms of spatial resolution, quantitativeness, gray resolution and execution time, the proposed methods perform better than the conventional regularization methods without this non-negative prior information. CONCLUSIONS The proposed methods improves the reconstruction images using the introduced non-negative prior information. Furthermore, the non-negative constraint facilitates the gradient computation, accelerating the minimization of the objective functions.
منابع مشابه
Reconstruction of Undersampled MR Data using Lp (0<p<1) Spatial Constraints
Introduction: L1 norm constrained reconstruction/compressed sensing techniques [1, 2] have recently been proposed to accelerate data acquisitions in MRI by acquiring fewer data in k-space. Image artifacts due to k-space undersampling are resolved by minimizing L1 norm of the sparse image estimate while preserving fidelity to the acquired data. Using an L1 norm constraint exploits implicit spars...
متن کاملImproved dynamic MRI reconstruction by exploiting sparsity and rank-deficiency.
In this paper we address the problem of dynamic MRI reconstruction from partially sampled K-space data. Our work is motivated by previous studies in this area that proposed exploiting the spatiotemporal correlation of the dynamic MRI sequence by posing the reconstruction problem as a least squares minimization regularized by sparsity and low-rank penalties. Ideally the sparsity and low-rank pen...
متن کاملLp-Regularized Least Squares (0<p<1) and Critical Path
The least squares problem is formulated in terms of lp quasi-norm regularization (0 < p < 1). Two formulations are considered: (i) an lp-constrained optimization and (ii) an lp-penalized (unconstrained) optimization. Due to the nonconvexity of the lp quasi-norm, the solution paths of the regularized least squares problem are not ensured to be continuous. A critical path, which is a maximal cont...
متن کاملLinearly Constrained Non-Lipschitz Optimization for Image Restoration
Abstract. Nonsmooth nonconvex optimization models have been widely used in the restoration and reconstruction of real images. In this paper, we consider a linearly constrained optimization problem with a non-Lipschitz regularization term in the objective function which includes the lp norm (0 < p < 1) of the gradient of the underlying image in the l2-lp problem as a special case. We prove that ...
متن کاملOn Lower and Upper Bounds of Matrices
k=1 |ak|. Hardy’s inequality can be interpreted as the lp operator norm of the Cesàro matrix C, given by cj,k = 1/j, k ≤ j, and 0 otherwise, is bounded on lp and has norm ≤ p/(p − 1) (The norm is in fact p/(p − 1)). It is known that the Cesàro operator is not bounded below, or the converse of inequality (1.1) does not hold for any positive constant. However, if one assumes C acting only on non-...
متن کامل